CSCLP 2005 Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming
نویسندگان
چکیده
“Heuristic synergy” refers to improvements in search performance when the decisions made by two or more heuristics are combined. This paper considers combinations based on products and quotients, and then a newer form of combination based on weighted sums of ratings from a set of base heuristics, some of which result in definite improvements in performance. Then, using recent results from an factor analytic study of heuristic performance, which showed two main effects of heuristics, which involve either immediate or future failure, it is shown that heuristic combinations are effective when they are able to balance these two actions. In addition, a factor analysis that included heuristic combinations did not reveal any evidence of new ‘factors’ in this case. In addition to elucidating the basis for heuristic synergy (or for the lack of it), this work suggests that the task of understanding heuristic search may devolve to an analysis of these two basic actions.
منابع مشابه
Abstract Verification and Debugging of Constraint Logic Programs
Verification and Debugging of Constraint Logic Programs Manuel Hermenegildo, Germán Puebla, Francisco Bueno, and Pedro López-Garćıa {herme,german,bueno,pedro}@fi.upm.es Department of Computer Science Technical University of Madrid (UPM)
متن کاملProceedings of the 11 th Annual ERCIM Workshop on Constraint Solving and Constraint Programming
Combining machine learning [13, 16] and constraint satisfaction techniques is attracting considerable attention from a variety of researchers in the constraints community. In this talk we will review several examples of how techniques from the field of machine learning can be successfully exploited in the domain of constraint satisfaction. In particular, we will consider how we can exploit mach...
متن کاملCHR 2009 — Proceedings of the 6 th International Workshop on Constraint Handling Rules
This volume contains the papers presented at CHR 2009, the sixth international workshop on Constraint Handling Rules, held on July 15th, 2009 at the occasion of ICLP 2009 and IJCAI 2009 in Pasadena (California, USA). Previous workshops on Constraint Handling Rules were organized in May 2004 in Ulm (Germany), in October 2005 in Sitges (Spain) at ICLP, in July 2006 in Venice (Italy) at ICALP, in ...
متن کاملA Note on Redundant Rules in Rule-Based Constraint Programming
Constraint propagation can sometimes be described conveniently in a rule-based way. Propagation is then fixpoint computation with rules. In the typical case when no specific strategy guides the fixpoint computation, it is preferable to have a minimal set of rules. We propose a natural criterion for redundancy of a rule, and describe a test for a class of rules. Its relevance is demonstrated by ...
متن کاملProceedings of CHR 2005, Second Workshop on Constraint Handling Rules
This book contains the Proceedings of CHR 2005, the Second Workshop on Constraint Handling Rules, held at the occasion of ICLP 2005 in Sitges (Spain) on October 5, 2005. The Constraint Handling Rules (CHR) language has become a major declarative specification and implementation language for constraint reasoning algorithms and applications. Algorithms are often specified using inference rules, r...
متن کامل